Mining Integrated Sequential Patterns From Multiple Databases
نویسندگان
چکیده
منابع مشابه
Mining Sequential Patterns in Dense Databases
Sequential pattern mining is an important data mining problem with broad applications, including the analysis of customer purchase patterns, Web access patterns, DNA analysis, and so on. We show on dense databases, a typical algorithm like Spade algorithm tends to lose its efficiency. Spade is based on the used of lists containing the localization of the occurrences of pattern in the sequences ...
متن کاملMining of high utility-probability sequential patterns from uncertain databases
High-utility sequential pattern mining (HUSPM) has become an important issue in the field of data mining. Several HUSPM algorithms have been designed to mine high-utility sequential patterns (HUPSPs). They have been applied in several real-life situations such as for consumer behavior analysis and event detection in sensor networks. Nonetheless, most studies on HUSPM have focused on mining HUPS...
متن کاملMining Sequential Patterns from Probabilistic Databases by Pattern-Growth
We propose a pattern-growth approach for mining sequential patterns from probabilistic databases. Our considered model of uncertainty is about the situations where there is uncertainty in associating an event with a source; and consider the problem of enumerating all sequences whose expected support satisfies a user-defined threshold θ. In an earlier work [Muzammal and Raman, PAKDD’11], adapted...
متن کاملIncremental Mining of Sequential Patterns in Large Databases
In this paper we consider the problem of the incremental mining of sequential patterns when new transactions or new customers are added to an original database. We present a new algorithm for mining frequent sequences that uses information collected during an earlier mining process to cut down the cost of finding new sequential patterns in the updated database. Our test shows that the algorithm...
متن کاملFast Mining of Sequential Patterns in Very Large Databases
In this paper we present a new algorithm for fast discovery of Sequential Patterns. Given a collection of items, a set of records over those items, and records belonging to a customer, the task is to identify all the commonly occurring sequences of items bought by the customers. An example of a sequential pattern could be that \30% of the people buying Douglas Adam's The Hitchhiker's Guide to t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Data Warehousing and Mining
سال: 2020
ISSN: 1548-3924,1548-3932
DOI: 10.4018/ijdwm.2020010101